On lazy randomized incremental construction
نویسندگان
چکیده
منابع مشابه
Randomized Incremental Construction of Compressed Quadtrees
We present a simple randomized incremental algorithm for building compressed quadtrees. The resulting algorithm seems to be simpler than previously known algorithms for this task.
متن کاملRandomized Incremental Construction of Abstract Voronoi Diagrams
Abstract Voronoi diagrams were introduced by R . Klein [Kle89b, Kle88a, Kle88b] as an axiomatic basis ofVoronoi diagrams. We show how to construct abstract Voronoi diagrams in time O(nlogn) by a randomized algorithm, which is based on Clarkson and Shor's randomized incremental construction technique [CS89]. The new algorithm has the following advantages over previous algorithms: • It can handle...
متن کاملQuick Trajectory Generation for Manipulators Using Incremental Randomized Graph Construction
Quick trajectory generation for manipulators are a prerequisite for task oriented (i.e. only tell what to do, but not how) manipulator control, because e.g. in order to grasp an object, rst the motion to reach that object must be performed. In addition, for dynamic environments the generation of the trajectory must be done very quick. This can be achieved using a graph based approach. Furthermo...
متن کاملThe Overlay of Minimization Diagrams in a Randomized Incremental Construction
In a randomized incremental construction of the minimization diagram of a collection of n hyperplanes in R , for d ≥ 2, the hyperplanes are inserted one by one, in a random order, and the minimization diagram is updated after each insertion. We show that if we retain all the versions of the diagram, without removing any old feature that is now replaced by new features, the expected combinatoria...
متن کاملRandomized construction diagrams * incremental of abstract Voronoi Rolf
Abstract Voronoi diagrams were introduced by R. Klein (1988) as an axiomatic basis of Voronoi diagrams. We show how to construct abstract Voronoi diagrams in time O(n log n) by a randomized algorithm, which is based on Clarkson and Shor’s randomized incremental construction technique (1989). The new algorithm has the following advantages over previous algorithms: l It can handle a much wider cl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete & Computational Geometry
سال: 1995
ISSN: 0179-5376,1432-0444
DOI: 10.1007/bf02570705